Volume 19, Issue 4, pp. 593-773
Please Note: Electronic articles are available well in advance of the printed articles.
The Number of Shortest Paths on the Surface of a Polyhedron
David M. Mount
pp. 593-611
Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees
F. Chin and H. F. Ting
pp. 612-626
Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero $4$
Bill Jackson
pp. 659-665
Planar Depth-First Search in $O(\log n)$ Parallel Time
Torben Hagerup
pp. 678-704
A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
WanSoo T. Rhee
pp. 705-710
Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
D. R. Stinson
pp. 711-717
On Finding and Verifying Locally Optimal Solutions
Mark W. Krentel
pp. 742-749
The Structure of Polynomial Ideals and Gröbner Bases
Thomas W. Dubé
pp. 750-773